منابع مشابه
Unguardedness mostly means many solutions
A widely accepted method to specify (possibly infinite) behaviour is to define it as the solution, in some process algebra, of a recursive specification, i.e., a system of recursive equations over the fundamental operations of the process algebra. The method only works if the recursive specification has a unique solution in the process algebra; it is well-known that guardedness is a sufficient ...
متن کاملMany Maybes Mean (Mostly) the Same Thing
At the core of soft computing is the intuition that from imprecise knowledge, we can still make reasonable inferences. This paper offers experimental and mathematical evidence for this intuition. Based on a literature review and a newly developed mathematics of ”reachability”, it is argued that searches through a space containing uncertainties, most of the reachable conclusions will be reached ...
متن کاملInfinitely many solutions for a bi-nonlocal equation with sign-changing weight functions
In this paper, we investigate the existence of infinitely many solutions for a bi-nonlocal equation with sign-changing weight functions. We use some natural constraints and the Ljusternik-Schnirelman critical point theory on C1-manifolds, to prove our main results.
متن کاملUncountably many bounded positive solutions for a second order nonlinear neutral delay partial difference equation
In this paper we consider the second order nonlinear neutral delay partial difference equation $Delta_nDelta_mbig(x_{m,n}+a_{m,n}x_{m-k,n-l}big)+ fbig(m,n,x_{m-tau,n-sigma}big)=b_{m,n}, mgeq m_{0},, ngeq n_{0}.$Under suitable conditions, by making use of the Banach fixed point theorem, we show the existence of uncountably many bounded positive solutions for the above partial difference equation...
متن کاملSome Ramanujan–Nagell equations with many solutions
If we fix y as 1 in (1) we obtain a Ramanujan-Nagell equation. In [4] Erdös, Stewart and Tijdeman proved that the exponential dependence on s in estimates (2) and (3) is not far from the truth by giving examples of Ramanujan-Nagell equations with many solutions. Let ε be a positive number, let 2 = p1, p2, . . . be the sequence of prime numbers and let n be an integer with n ≥ 2. They proved tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.02.046